New Constructions of Covering Codes
نویسنده
چکیده
Covering code constructions obtaining new codes from starting ones were developed during last years. In this work we propose new constructions of such kind. New linear and nonlinear covering codes and an infinite families of those are obtained with the help of constructions proposed. A table of new upper bounds on the length function is given.
منابع مشابه
Constructions and families of covering codes and saturated sets of points in projective geometry
In a recent paper by this author, constructions of linear binary covering codes are considered. In this work, constructions and techniques of the earlier paper are developed and modified for q-ary linear nonbinary covering codes, q 2 3, and new constructions are proposed. The described constructions design an infinite family of codes with covering radius R based on a starting code of the same c...
متن کاملConstructions of nonlinear covering codes
Constructions of nonlinear covering codes are given. Using any nonlinear starting code of covering radius R 2 these constructions form an infinite family of codes with the same covering radius. A nonlinear code is treated as a union of cosets of a linear code. New infinite families of nonlinear covering codes are obtained. Concepts of R; l-objects, R; l-partitions, and R; l-length are described...
متن کاملConstructions and families of nonbinary linear codes with covering radius 2
New constructions of linear nonbinary codes with covering radius R = 2 are proposed. They are in part modifications of earlier constructions by the author and in part are new. Using a starting code with R = 2 as a “seed” these constructions yield an infinite family of codes with the same covering radius. New infinite families of codes with R = 2 are obtained for all alphabets of size q 4 and al...
متن کاملNew Quaternary Linear Codes with Covering Radius 21
A new quaternary linear code of length 19, codimension 5, and covering radius 2 is found in a computer search using tabu search, a local search heuristic. Starting from this code, which has some useful partitioning properties, di!erent lengthening constructions are applied to get an in"nite family of new, record-breaking quaternary codes of covering radius 2 and odd codimension. An algebraic co...
متن کاملNew Constructions for q-ary Covering Codes
Upper bounds on Kq (n; R), the minimum number of codewords in a q-ary code of length n and covering radius R, are improved. Such bounds are obtained by constructing corresponding covering codes. In particular, codes of length q + 1 are discussed. Good such codes can be obtained from maximum distance separable (MDS) codes. Furthermore, they can often be combined eeectively with other covering co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 22 شماره
صفحات -
تاریخ انتشار 2001